Location:
Search - prime number
Search list
Description: 求素数的程序，用了一些标准库．不难，但很有用-Prime number for the procedure, using a number of standard library. It is not difficult, but very useful
Platform: |
Size: 384000 |
Author: zjs |
Hits:
Description: 這個程式可以顯示 3~100 的 prime number，很適合新手練習的範例程式，附上源碼可以修改內部細節，多做驗證。
Platform: |
Size: 51200 |
Author: 劉逸 |
Hits:
Description: 本程序完成了欧几里得算法求最大公约数、扩展欧几里得算法求乘法逆元和素性检验判断输入的数是否为素数-This procedure for the completion of the Euclid algorithm for greatest common divisor, extended Euclid algorithm for multiplication and inverse primality test to determine whether the number entered for the prime number
Platform: |
Size: 28672 |
Author: chenchenrao |
Hits:
Description: Test your system performance.
From finding the Prime number.
Platform: |
Size: 8192 |
Author: yaling |
Hits:
Description: 用Eratosthenes筛选算法,在1000000中求质数,分别用了串行算法,改进的串行算法,并行算法(openmp)实现,比较了执行时间-Eratosthenes screening algorithm used in prime number 1000000 in order to, respectively, with the serial algorithm, the improved serial algorithm, parallel algorithm (openmp) realize, compares the execution time
Platform: |
Size: 158720 |
Author: dd |
Hits:
Description: 题目
质数分解与栈的使用
简介
只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如：
1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Every integer can be written in the form of the product of prime numbers, called the prime number decomposition of an integer. For example: 1776 = 37 x 3 x 2 x 2 x 2 x 2.
Platform: |
Size: 1024 |
Author: katrina |
Hits:
Description: 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。-Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that good.
Platform: |
Size: 121856 |
Author: 1234 |
Hits:
Description: 该程序用以查找任意两个整数之间的所有素数。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT-The program used to search any two integers all prime numbers between. Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT
Platform: |
Size: 11264 |
Author: rockeyzhu |
Hits:
Description: 素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可
1.与前面所有的数不重复
2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法； A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个； B、如果不合法：选择下一种可能；-Prime Central: 1-10 from 10 the number of put this into a ring, asked the two adjacent numbers and is a prime number. 〗 〖Analysis is a retrospective this topic. From 1 year, 9 out of every space possible, each may be bound by the conditions of accession to 1. And in front of all the number of non-repetition, 2. With a few and for a prime number (the last and the first to meet). 1〗 〖algorithm processes the data to initialize 2, fill in the number of recursion: first to determine the legality of J possible A, if the legitimate: the number of Reclamation to determine whether the target (10 have been completed): Yes, print the results of not, fill in the next recursive B, if not legitimate: a possible alternative
Platform: |
Size: 55296 |
Author: bingo |
Hits:
Description: 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
Platform: |
Size: 1024 |
Author: li shu |
Hits:
Description: it is a RMI system which check if the number is prime or not prime(the number which the client send it)it is a RMI system which check if the number is prime or not prime(the number which the client send it)
Platform: |
Size: 3072 |
Author: hamad |
Hits:
Description: 素数填表另一种解法 素数填表另一种解法 -Another solution prime prime Guidance Guidance Guidance another solution of another prime number prime number solution filling another solution
Platform: |
Size: 231424 |
Author: ilove |
Hits:
Description: 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100
Platform: |
Size: 1866752 |
Author: 飘摇 |
Hits:
Description: 用筛选法求m内的素数，给一个数求其是几位数，并输出每位数-Screening and m within a prime number, give a number for its several numbers, and the number of output per person.
Platform: |
Size: 2048 |
Author: 梧桐雨 |
Hits:
Description: RSA的实现，内含有一个大素数类，很实用。-The realization of RSA, contains a large prime number class, very practical.
Platform: |
Size: 10240 |
Author: super |
Hits:
Description: 实现查询质数的功能，并能查询数目,可以在所有质数中查询
-check the prime number
Platform: |
Size: 184320 |
Author: lty |
Hits:
Description: 判断随机整数是否是素数
产生100个0-999之间的随机整数，然后判断这100个随机整数哪些是素数，哪些不是？
-Determine whether random integer is a prime number generator 100 random integer between 0-999, and then determine which 100 random integers which are prime and which are not?
Platform: |
Size: 3072 |
Author: 常文静 |
Hits:
Description: 求1000内素数，配套算法教材，枚举算法的另一个应用- prime number（enumeration algorithm）
Platform: |
Size: 1024 |
Author: 黄立 |
Hits:
Description: Prime number program in c: c program for prime number, this code prints prime numbers using c programming language. To check whether a number is prime or not see another code below. Prime number logic: a number is prime if it is divisible only by one and itself. Remember two is the only even and also the smallest prime number. First few prime numbers are 2, 3, 5, 7, 11, 13, 17....etc. Prime numbers have many applications in computer science and mathematics. A number greater than one can be factorized into prime numbers, For example 540 = 22*33*51
Platform: |
Size: 3072 |
Author: fpthl |
Hits:
Description: prime number program
Platform: |
Size: 9216 |
Author: naina Rawat |
Hits:
« 12
3
4
5
6
7
8
9
10
...
40
»